Fertilization optimization algorithm on CEC2015 and large scale problems
نویسندگان
چکیده
Abstract This work, presents a novel optimizer called fertilization optimization algorithm, which is based on levy flight and random search within space. It biologically inspired algorithm by the of egg in reproduction mammals. The performance was compared with other algorithms CEC2015 time expensive benchmarks large scale problems. Remarkably, has overcome optimizers many cases examination comparison results are encouraging to use possible applications.
منابع مشابه
A Practical Algorithm for General Large Scale Nonlinear Optimization Problems
We provide an eeective and eecient implementation of a sequential quadratic programming (SQP) algorithm for the general large scale nonlinear programming problem. In this algorithm the quadratic programming subproblems are solved by an interior point method that can be prematurely halted by a trust region constraint. Numerous computational enhancements to improve the numerical performance are p...
متن کاملDISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملOn large-scale unconstrained optimization problems and higher order methods
Third order methods will in most cases use fewer iterations than a second order method to reach the same accuracy. However, the number of arithmetic operations per iteration is higher for third order methods than a second order method. Newton’s method is the most commonly used second order method and Halley’s method is the most well-known third order method. Newton’s method is more used in prac...
متن کاملA Survey on Metaheuristics for Solving Large Scale Optimization Problems
In recent years, there has been a remarkable improvement in the computing power of computers. As a result, numerous realworld optimization problems in science and engineering, possessing very high dimensions, have appeared. In the research community, they are generally labeled as Large Scale Global Optimization (LSGO) problems. Several Metaheuristics has been proposed to tackle these problems. ...
متن کاملOn how to solve large-scale log-determinant optimization problems
We propose a proximal augmented Lagrangian method and a hybrid method, i.e., employing the proximal augmented Lagrangian method to generate a good initial point and then employing the Newton-CG augmented Lagrangian method to get a highly accurate solution, to solve large-scale nonlinear semidefinite programming problems whose objective functions are a sum of a convex quadratic function and a lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pollack Periodica
سال: 2022
ISSN: ['1788-1994', '1788-3911']
DOI: https://doi.org/10.1556/606.2021.00343